Using constraint preconditioners with regularized saddle-point problems
نویسندگان
چکیده
The problem of finding good preconditioners for the numerical solution of a certain important class of indefinite linear systems is considered. These systems are of a 2 by 2 block structure in which the (2,2) block (denoted by −C) is assumed to be nonzero. In Constraint preconditioning for indefinite linear systems, SIAM J. Matrix Anal. Appl., 21 (2000), Keller, Gould and Wathen introduced the idea of using constraint preconditioners that have a specific 2 by 2 block structure for the case of C being zero. We shall give results concerning the spectrum and form of the eigenvectors when a preconditioner of the form considered by Keller, Gould and Wathen is used but the system we wish to solve may have C 6= 0. Numerical results to validate our conclusions are also presented.
منابع مشابه
Preconditioners for regularized saddle point problems with an application for heterogeneous Darcy flow problems
Saddle point problems arise in the modelling of many important practical problems. Preconditioners for the corresponding matrices on block triangular form, based on coupled inner-outer iteration methods are analyzed and applied to a Darcy flow problem, possibly with strong heterogeneity and to non-symmetric saddle point problems. Using proper regularized forms of the given matrix and its precon...
متن کاملThe University of Reading Department of Mathematics Constraint-style preconditioners for regularized saddle point problems
The problem of finding good preconditioners for the numerical solution of an important class of indefinite linear systems is considered. These systems are of a regularized saddle point structure [ A B B −C ] [ x y ] = [ c d ] , where A ∈ Rn×n, C ∈ Rm×m are symmetric and B ∈ Rm×n. In Constraint preconditioning for indefinite linear systems, SIAM J. Matrix Anal. Appl., 21 (2000), Keller, Gould an...
متن کاملPreconditioning of Active-Set Newton Methods for PDE-constrained Optimal Control Problems
We address the problem of preconditioning a sequence of saddle point linear systems arising in the solution of PDE-constrained optimal control problems via active-set Newton methods, with control and (regularized) state constraints. We present two new preconditioners based on a full block matrix factorization of the Schur complement of the Jacobian matrices, where the active-set blocks are merg...
متن کاملAn Implicit Approximate Inverse Preconditioner for Saddle Point Problems
We present a preconditioner for saddle point problems which is based on an approximation of an implicit representation of the inverse of the saddle point matrix. Whereas this preconditioner does not require an approximation to the Schur complement, its theoretical analysis yields some interesting relationship to some Schurcomplement-based preconditioners. Whereas the evaluation of this new prec...
متن کاملRegularized HSS Iteration Method for Saddle - Point Linear Systems
We propose a class of regularized Hermitian and skew-Hermitian splitting methods for the solution of large, sparse linear systems in saddle-point form. These methods can be used as stationary iterative solvers or as preconditioners for Krylov subspace methods. We establish unconditional convergence of the stationary iterations and we examine the spectral properties of the corresponding precondi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comp. Opt. and Appl.
دوره 36 شماره
صفحات -
تاریخ انتشار 2007